Algorithmic analysis of array-accessing programs
نویسندگان
چکیده
منابع مشابه
an infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولAlgorithmic Analysis of Programs with Well Quasi-ordered Domains
Interpretation. The above analysis algorithm can also be phrased in terms of abstract interpretation [CC77, JN94]. We intend to compute the fixpoint +X .I _ pre(X) for a set I S by iteration. Instead of computing this fixpoint in the lattice (2, ) of sets of states, we move to the abstract lattice (M, C =) , where M is the set of canonical subsets of S, and where M C =M$ if C(M) C(M$). The corr...
متن کاملAlgorithmic Debugging of Java Programs
In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative languages. The declarative debugger builds a suitable computation tree containing information about method invocations occurred during a wrong computation. The tree is then navigated, asking the user questions in order to c...
متن کاملAutotuning programs with algorithmic choice
The process of optimizing programs and libraries, both for performance and quality of service, can be viewed as a search problem over the space of implementation choices. This search is traditionally manually conducted by the programmer and often must be repeated when systems, tools, or requirements change. The overriding goal of this work is to automate this search so that programs can change ...
متن کاملPrecise Analysis of Array Usage in Scientific Programs
The automatic transformation of sequential programs for e cient execution on parallel computers involves a number of analyses and restructurings of the input. Some of these analyses are based on computing array sections; a compact description of a range of array elements. Array sections describe the set of array elements that are either read or written by program statements. These sections can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2012
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2287718.2287727